Evaluating compass routing based AOI-cast by MOGs mobility models

نویسندگان

  • Emanuele Carlini
  • Massimo Coppola
  • Laura Ricci
چکیده

The increasing popularity of Multiplayer Online Games (MOGs) is revealing a huge interest from the research community. Many solutions exploiting P2P technologies have been proposed in order to overtake the limits of the centralized infrastructures. These solutions are based on the definition of a proper dynamic P2P overlay and exploit the concept of Area of Interest (AOI) to filter the information relevant for each player. An AOI-cast mechanism defines a spanning tree over the AOI so that the information generated by a player is propagated to all the players located in its AOI. Although most proposals are founded on solid basis, they are often validated through players’ movement patterns that result different form those of a real MOG. This paper presents a set of mobility models for the evaluation of the AOI-cast. Together with classical mobility models, mobility patterns derived from popular MOGs, i.e. World of Warcraft(WoW) and Second Life(SL), are also presented. A novel mobility mobility model taking into account the WoW battleground scenarios is proposed. The proposed mobility models are exploited to evaluate an AOI-cast algorithm based on the definition of a Delaunay overlay. The experiments show that the AOI-cast mechanism we propose can be exploited in real scenarios only when a set of conditions hold.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AOI-cast in distributed virtual environments: an approach based on delay tolerant reverse compass routing

This paper presents a novel AOI-cast algorithm for Distributed Virtual Environments targeted to Delaunaybased P2P overlays. The algorithm exploits the mathematical properties of the Delaunay Triangulations to build a spanning tree supporting the notification of the events generated by a peer to the other ones located in its Area of Interest (AOI). The spanning tree is computed by reversing comp...

متن کامل

Performance Evaluation of Position-Based Routing Protocols using Different Mobility Models in MANET

A Mobile Ad hoc network (MANET) is a dynamic selforganizing multi-hop wireless network. Owing the random and unpredictable movement of the mobile nodes, the topology is changing rapidly and frequently. In MANET, where is no routing infrastructure like fixed routers and routing backbones, all MNs participate in the routing process. Recently, position-aware routing protocols, and because of their...

متن کامل

Performance Analysis of MANET Routing Protocols over Different Mobility Models

School of Computing and Mathematical Sciences University of Greenwich London, United Kingdom {ie903, et701, M.Ghassemian}@greenwich.ac.uk This work is a simulation based comparison of three Mobile Ad Hoc Networks (MANETs) routing protocols – Destination Sequenced Distance Vector (DSDV), Ad hoc on demand Distance Vector (AODV) and Dynamic Source Routing (DSR). The comparison is based on their pe...

متن کامل

COMPASS – Latency Optimal Routing in Heterogeneous Chord-based P2P Systems

During the last decade, overlay networks based on distributed hash tables have become the de facto standard for data management in Peerto-Peer (P2P) systems, with Chord being its most prominent representative. Essentially, with its fully decentralized approach, Chord avoids any bottleneck and single point of failure while guaranteeing data to be retrieved in O(logN) hops in a network consisting...

متن کامل

IMPORTANT: A framework to systematically analyze the Impact of Mobility on Performance of RouTing protocols for Adhoc NeTworks

A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any existing infrastructure. Since not many MANETs are currently deployed, research in this area is mostly simulation based. Random Waypoint is the commonly used mobility model in these simulations. Random Waypoint is a simple model that may be applicable to some scenarios. However...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011